TSTP Solution File: GRA040^2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRA040^2 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 00:00:42 EDT 2023
% Result : CounterSatisfiable 30.61s 30.89s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRA040^2 : TPTP v8.1.2. Released v3.6.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 04:04:50 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 %----Proving TH0
% 0.21/0.49 %------------------------------------------------------------------------------
% 0.21/0.49 % File : GRA040^2 : TPTP v8.1.2. Released v3.6.0.
% 0.21/0.49 % Domain : Graph Theory
% 0.21/0.49 % Problem : R(6,8) <= 256
% 0.21/0.49 % Version : Especial.
% 0.21/0.49 % English :
% 0.21/0.49
% 0.21/0.49 % Refs : [Rad06] Radziszowski (2006), Small Ramsey Numbers
% 0.21/0.49 % : [Bro08] Brown (2008), Email to G. Sutcliffe
% 0.21/0.49 % Source : [Bro08]
% 0.21/0.49 % Names :
% 0.21/0.49
% 0.21/0.49 % Status : CounterCounterSatisfiable
% 0.21/0.49 % Rating : 1.00 v8.1.0, 0.00 v7.4.0, 1.00 v3.7.0
% 0.21/0.49 % Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% 0.21/0.49 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.21/0.49 % Maximal formula atoms : 0 ( 0 avg)
% 0.21/0.49 % Number of connectives : 408 ( 102 ~; 1 |; 127 &; 176 @)
% 0.21/0.49 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.21/0.49 % Maximal formula depth : 105 ( 105 avg)
% 0.21/0.49 % Number of types : 1 ( 0 usr)
% 0.21/0.49 % Number of type conns : 104 ( 104 >; 0 *; 0 +; 0 <<)
% 0.21/0.49 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.21/0.49 % Number of variables : 29 ( 0 ^; 3 !; 26 ?; 29 :)
% 0.21/0.49 % SPC : TH0_OPN_NEQ_NAR
% 0.21/0.49
% 0.21/0.49 % Comments : If a type alpha has exactly n elements, then we can prove
% 0.21/0.49 % R(k,l) > n by finding a graph (symmetric binary relation) on type
% 0.21/0.49 % alpha with no k-cliques and no l-independent sets. Likewise, we
% 0.21/0.49 % can prove R(k,l) <= n by proving every graph (symmetric binary
% 0.21/0.49 % relation) on alpha must have a k-clique or l-independent set.
% 0.21/0.49 % There is one type with 4 elements: o > o. There are two types
% 0.21/0.49 % with 16 elements: o > o > o and (o > o) > o. There are two types
% 0.21/0.49 % with 256 elements: o > o > o > o and o > (o > o) > o. This means
% 0.21/0.49 % we always have two formulations of R(k,l) >/<= 16 and two
% 0.21/0.49 % formulations of R(k,l) >/<= 256.
% 0.21/0.49 % :
% 0.21/0.49 %------------------------------------------------------------------------------
% 0.21/0.49 thf(ramsey_u_6_8_256a,conjecture,
% 0.21/0.49 ! [G: ( $o > ( $o > $o ) > $o ) > ( $o > ( $o > $o ) > $o ) > $o] :
% 0.21/0.49 ( ! [Xx: $o > ( $o > $o ) > $o,Xy: $o > ( $o > $o ) > $o] :
% 0.21/0.49 ( ( G @ Xx @ Xy )
% 0.21/0.49 => ( G @ Xy @ Xx ) )
% 0.21/0.49 => ( ? [Xx0: $o > ( $o > $o ) > $o,Xx1: $o > ( $o > $o ) > $o,Xx2: $o > ( $o > $o ) > $o,Xx3: $o > ( $o > $o ) > $o,Xx4: $o > ( $o > $o ) > $o,Xx5: $o > ( $o > $o ) > $o,Xp0: ( $o > ( $o > $o ) > $o ) > $o,Xp1: ( $o > ( $o > $o ) > $o ) > $o,Xp2: ( $o > ( $o > $o ) > $o ) > $o,Xp3: ( $o > ( $o > $o ) > $o ) > $o,Xp4: ( $o > ( $o > $o ) > $o ) > $o] :
% 0.21/0.49 ( ( Xp0 @ Xx0 )
% 0.21/0.49 & ~ ( Xp0 @ Xx1 )
% 0.21/0.49 & ~ ( Xp0 @ Xx2 )
% 0.21/0.49 & ~ ( Xp0 @ Xx3 )
% 0.21/0.49 & ~ ( Xp0 @ Xx4 )
% 0.21/0.49 & ~ ( Xp0 @ Xx5 )
% 0.21/0.49 & ~ ( Xp1 @ Xx0 )
% 0.21/0.49 & ( Xp1 @ Xx1 )
% 0.21/0.49 & ~ ( Xp1 @ Xx2 )
% 0.21/0.49 & ~ ( Xp1 @ Xx3 )
% 0.21/0.49 & ~ ( Xp1 @ Xx4 )
% 0.21/0.49 & ~ ( Xp1 @ Xx5 )
% 0.21/0.49 & ~ ( Xp2 @ Xx0 )
% 0.21/0.49 & ~ ( Xp2 @ Xx1 )
% 0.21/0.49 & ( Xp2 @ Xx2 )
% 0.21/0.49 & ~ ( Xp2 @ Xx3 )
% 0.21/0.49 & ~ ( Xp2 @ Xx4 )
% 0.21/0.49 & ~ ( Xp2 @ Xx5 )
% 0.21/0.49 & ~ ( Xp3 @ Xx0 )
% 0.21/0.49 & ~ ( Xp3 @ Xx1 )
% 0.21/0.49 & ~ ( Xp3 @ Xx2 )
% 0.21/0.49 & ( Xp3 @ Xx3 )
% 0.21/0.49 & ~ ( Xp3 @ Xx4 )
% 0.21/0.49 & ~ ( Xp3 @ Xx5 )
% 0.21/0.49 & ~ ( Xp4 @ Xx0 )
% 0.21/0.49 & ~ ( Xp4 @ Xx1 )
% 0.21/0.49 & ~ ( Xp4 @ Xx2 )
% 0.21/0.49 & ~ ( Xp4 @ Xx3 )
% 0.21/0.49 & ( Xp4 @ Xx4 )
% 0.21/0.49 & ~ ( Xp4 @ Xx5 )
% 0.21/0.49 & ( G @ Xx1 @ Xx0 )
% 0.21/0.49 & ( G @ Xx2 @ Xx0 )
% 0.21/0.49 & ( G @ Xx2 @ Xx1 )
% 0.21/0.49 & ( G @ Xx3 @ Xx0 )
% 0.21/0.49 & ( G @ Xx3 @ Xx1 )
% 0.21/0.49 & ( G @ Xx3 @ Xx2 )
% 0.21/0.49 & ( G @ Xx4 @ Xx0 )
% 0.21/0.49 & ( G @ Xx4 @ Xx1 )
% 0.21/0.49 & ( G @ Xx4 @ Xx2 )
% 0.21/0.49 & ( G @ Xx4 @ Xx3 )
% 0.21/0.49 & ( G @ Xx5 @ Xx0 )
% 0.21/0.49 & ( G @ Xx5 @ Xx1 )
% 0.21/0.49 & ( G @ Xx5 @ Xx2 )
% 0.21/0.49 & ( G @ Xx5 @ Xx3 )
% 0.21/0.49 & ( G @ Xx5 @ Xx4 ) )
% 0.21/0.49 | ? [Xx0: $o > ( $o > $o ) > $o,Xx1: $o > ( $o > $o ) > $o,Xx2: $o > ( $o > $o ) > $o,Xx3: $o > ( $o > $o ) > $o,Xx4: $o > ( $o > $o ) > $o,Xx5: $o > ( $o > $o ) > $o,Xx6: $o > ( $o > $o ) > $o,Xx7: $o > ( $o > $o ) > $o,Xp0: ( $o > ( $o > $o ) > $o ) > $o,Xp1: ( $o > ( $o > $o ) > $o ) > $o,Xp2: ( $o > ( $o > $o ) > $o ) > $o,Xp3: ( $o > ( $o > $o ) > $o ) > $o,Xp4: ( $o > ( $o > $o ) > $o ) > $o,Xp5: ( $o > ( $o > $o ) > $o ) > $o,Xp6: ( $o > ( $o > $o ) > $o ) > $o] :
% 0.21/0.50 ( ( Xp0 @ Xx0 )
% 0.21/0.50 & ~ ( Xp0 @ Xx1 )
% 0.21/0.50 & ~ ( Xp0 @ Xx2 )
% 0.21/0.50 & ~ ( Xp0 @ Xx3 )
% 0.21/0.50 & ~ ( Xp0 @ Xx4 )
% 0.21/0.50 & ~ ( Xp0 @ Xx5 )
% 0.21/0.50 & ~ ( Xp0 @ Xx6 )
% 0.21/0.50 & ~ ( Xp0 @ Xx7 )
% 0.21/0.50 & ~ ( Xp1 @ Xx0 )
% 0.21/0.50 & ( Xp1 @ Xx1 )
% 0.21/0.50 & ~ ( Xp1 @ Xx2 )
% 0.21/0.50 & ~ ( Xp1 @ Xx3 )
% 0.21/0.50 & ~ ( Xp1 @ Xx4 )
% 0.21/0.50 & ~ ( Xp1 @ Xx5 )
% 0.21/0.50 & ~ ( Xp1 @ Xx6 )
% 0.21/0.50 & ~ ( Xp1 @ Xx7 )
% 0.21/0.50 & ~ ( Xp2 @ Xx0 )
% 0.21/0.50 & ~ ( Xp2 @ Xx1 )
% 0.21/0.50 & ( Xp2 @ Xx2 )
% 0.21/0.50 & ~ ( Xp2 @ Xx3 )
% 0.21/0.50 & ~ ( Xp2 @ Xx4 )
% 0.21/0.50 & ~ ( Xp2 @ Xx5 )
% 0.21/0.50 & ~ ( Xp2 @ Xx6 )
% 0.21/0.50 & ~ ( Xp2 @ Xx7 )
% 0.21/0.50 & ~ ( Xp3 @ Xx0 )
% 0.21/0.50 & ~ ( Xp3 @ Xx1 )
% 0.21/0.50 & ~ ( Xp3 @ Xx2 )
% 0.21/0.50 & ( Xp3 @ Xx3 )
% 0.21/0.50 & ~ ( Xp3 @ Xx4 )
% 0.21/0.50 & ~ ( Xp3 @ Xx5 )
% 0.21/0.50 & ~ ( Xp3 @ Xx6 )
% 0.21/0.50 & ~ ( Xp3 @ Xx7 )
% 0.21/0.50 & ~ ( Xp4 @ Xx0 )
% 0.21/0.50 & ~ ( Xp4 @ Xx1 )
% 0.21/0.50 & ~ ( Xp4 @ Xx2 )
% 0.21/0.50 & ~ ( Xp4 @ Xx3 )
% 0.21/0.50 & ( Xp4 @ Xx4 )
% 0.21/0.50 & ~ ( Xp4 @ Xx5 )
% 0.21/0.50 & ~ ( Xp4 @ Xx6 )
% 0.21/0.50 & ~ ( Xp4 @ Xx7 )
% 0.21/0.50 & ~ ( Xp5 @ Xx0 )
% 0.21/0.50 & ~ ( Xp5 @ Xx1 )
% 0.21/0.50 & ~ ( Xp5 @ Xx2 )
% 0.21/0.50 & ~ ( Xp5 @ Xx3 )
% 0.21/0.50 & ~ ( Xp5 @ Xx4 )
% 0.21/0.50 & ( Xp5 @ Xx5 )
% 0.21/0.50 & ~ ( Xp5 @ Xx6 )
% 0.21/0.50 & ~ ( Xp5 @ Xx7 )
% 0.21/0.50 & ~ ( Xp6 @ Xx0 )
% 0.21/0.50 & ~ ( Xp6 @ Xx1 )
% 0.21/0.50 & ~ ( Xp6 @ Xx2 )
% 0.21/0.50 & ~ ( Xp6 @ Xx3 )
% 0.21/0.50 & ~ ( Xp6 @ Xx4 )
% 0.21/0.50 & ~ ( Xp6 @ Xx5 )
% 0.21/0.50 & ( Xp6 @ Xx6 )
% 0.21/0.50 & ~ ( Xp6 @ Xx7 )
% 0.21/0.50 & ~ ( G @ Xx1 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx2 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx2 @ Xx1 )
% 0.21/0.50 & ~ ( G @ Xx3 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx3 @ Xx1 )
% 0.21/0.50 & ~ ( G @ Xx3 @ Xx2 )
% 0.21/0.50 & ~ ( G @ Xx4 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx4 @ Xx1 )
% 0.21/0.50 & ~ ( G @ Xx4 @ Xx2 )
% 0.21/0.50 & ~ ( G @ Xx4 @ Xx3 )
% 0.21/0.50 & ~ ( G @ Xx5 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx5 @ Xx1 )
% 0.21/0.50 & ~ ( G @ Xx5 @ Xx2 )
% 0.21/0.50 & ~ ( G @ Xx5 @ Xx3 )
% 0.21/0.50 & ~ ( G @ Xx5 @ Xx4 )
% 0.21/0.50 & ~ ( G @ Xx6 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx6 @ Xx1 )
% 0.21/0.50 & ~ ( G @ Xx6 @ Xx2 )
% 0.21/0.50 & ~ ( G @ Xx6 @ Xx3 )
% 0.21/0.50 & ~ ( G @ Xx6 @ Xx4 )
% 0.21/0.50 & ~ ( G @ Xx6 @ Xx5 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx0 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx1 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx2 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx3 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx4 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx5 )
% 0.21/0.50 & ~ ( G @ Xx7 @ Xx6 ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 %------------------------------------------------------------------------------
% 0.21/0.50 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.czjvdkMlyf/cvc5---1.0.5_21124.p...
% 0.21/0.50 (declare-sort $$unsorted 0)
% 0.21/0.50 (assert (not (forall ((G (-> (-> Bool (-> Bool Bool) Bool) (-> Bool (-> Bool Bool) Bool) Bool))) (=> (forall ((Xx (-> Bool (-> Bool Bool) Bool)) (Xy (-> Bool (-> Bool Bool) Bool))) (=> (@ (@ G Xx) Xy) (@ (@ G Xy) Xx))) (or (exists ((Xx0 (-> Bool (-> Bool Bool) Bool)) (Xx1 (-> Bool (-> Bool Bool) Bool)) (Xx2 (-> Bool (-> Bool Bool) Bool)) (Xx3 (-> Bool (-> Bool Bool) Bool)) (Xx4 (-> Bool (-> Bool Bool) Bool)) (Xx5 (-> Bool (-> Bool Bool) Bool)) (Xp0 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp1 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp2 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp3 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp4 (-> (-> Bool (-> Bool Bool) Bool) Bool))) (let ((_let_1 (@ G Xx5))) (let ((_let_2 (@ G Xx4))) (let ((_let_3 (@ G Xx3))) (let ((_let_4 (@ G Xx2))) (and (@ Xp0 Xx0) (not (@ Xp0 Xx1)) (not (@ Xp0 Xx2)) (not (@ Xp0 Xx3)) (not (@ Xp0 Xx4)) (not (@ Xp0 Xx5)) (not (@ Xp1 Xx0)) (@ Xp1 Xx1) (not (@ Xp1 Xx2)) (not (@ Xp1 Xx3)) (not (@ Xp1 Xx4)) (not (@ Xp1 Xx5)) (not (@ Xp2 Xx0)) (not (@ Xp2 Xx1)) (@ Xp2 Xx2) (not (@ Xp2 Xx3)) (not (@ Xp2 Xx4)) (not (@ Xp2 Xx5)) (not (@ Xp3 Xx0)) (not (@ Xp3 Xx1)) (not (@ Xp3 Xx2)) (@ Xp3 Xx3) (not (@ Xp3 Xx4)) (not (@ Xp3 Xx5)) (not (@ Xp4 Xx0)) (not (@ Xp4 Xx1)) (not (@ Xp4 Xx2)) (not (@ Xp4 Xx3)) (@ Xp4 Xx4) (not (@ Xp4 Xx5)) (@ (@ G Xx1) Xx0) (@ _let_4 Xx0) (@ _let_4 Xx1) (@ _let_3 Xx0) (@ _let_3 Xx1) (@ _let_3 Xx2) (@ _let_2 Xx0) (@ _let_2 Xx1) (@ _let_2 Xx2) (@ _let_2 Xx3) (@ _let_1 Xx0) (@ _let_1 Xx1) (@ _let_1 Xx2) (@ _let_1 Xx3) (@ _let_1 Xx4))))))) (exists ((Xx0 (-> Bool (-> Bool Bool) Bool)) (Xx1 (-> Bool (-> Bool Bool) Bool)) (Xx2 (-> Bool (-> Bool Bool) Bool)) (Xx3 (-> Bool (-> Bool Bool) Bool)) (Xx4 (-> Bool (-> Bool Bool) Bool)) (Xx5 (-> Bool (-> Bool Bool) Bool)) (Xx6 (-> Bool (-> Bool Bool) Bool)) (Xx7 (-> Bool (-> Bool Bool) Bool)) (Xp0 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp1 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp2 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp3 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp4 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp5 (-> (-> Bool (-> Bool Bool) Bool) Bool)) (Xp6 (-> (-> Bool (-> Bool Bool) Bool) Bool))) (let ((_let_1 (@ G Xx7))) (let ((_let_2 (@ G Xx6))) (let ((_let_3 (@ G Xx5))) (let ((_let_4 (@ G Xx4))) (let ((_let_5 (@ G Xx3))) (let ((_let_6 (@ G Xx2))) (and (@ Xp0 Xx0) (not (@ Xp0 Xx1)) (not (@ Xp0 Xx2)) (not (@ Xp0 Xx3)) (not (@ Xp0 Xx4)) (not (@ Xp0 Xx5)) (not (@ Xp0 Xx6)) (not (@ Xp0 Xx7)) (not (@ Xp1 Xx0)) (@ Xp1 Xx1) (not (@ Xp1 Xx2)) (not (@ Xp1 Xx3)) (not (@ Xp1 Xx4)) (not (@ Xp1 Xx5)) (not (@ Xp1 Xx6)) (not (@ Xp1 Xx7)) (not (@ Xp2 Xx0)) (not (@ Xp2 Xx1)) (@ Xp2 Xx2) (not (@ Xp2 Xx3)) (not (@ Xp2 Xx4)) (not (@ Xp2 Xx5)) (not (@ Xp2 Xx6)) (not (@ Xp2 Xx7)) (not (@ Xp3 Xx0)) (not (@ Xp3 Xx1)) (not (@ Xp3 Xx2)) (@ Xp3 Xx3) (not (@ Xp3 Xx4)) (not (@ Xp3 Xx5)) (not (@ Xp3 Xx6)) (not (@ Xp3 Xx7)) (not (@ Xp4 Xx0)) (not (@ Xp4 Xx1)) (not (@ Xp4 Xx2)) (not (@ Xp4 Xx3)) (@ Xp4 Xx4) (not (@ Xp4 Xx5)) (not (@ Xp4 Xx6)) (not (@ Xp4 Xx7)) (not (@ Xp5 Xx0)) (not (@ Xp5 Xx1)) (not (@ Xp5 Xx2)) (not (@ Xp5 Xx3)) (not (@ Xp5 Xx4)) (@ Xp5 Xx5) (not (@ Xp5 Xx6)) (not (@ Xp5 Xx7)) (not (@ Xp6 Xx0)) (not (@ Xp6 Xx1)) (not (@ Xp6 Xx2)) (not (@ Xp6 Xx3)) (not (@ Xp6 Xx4)) (not (@ Xp6 Xx5)) (@ Xp6 Xx6) (not (@ Xp6 Xx7)) (not (@ (@ G Xx1) Xx0)) (not (@ _let_6 Xx0)) (not (@ _let_6 Xx1)) (not (@ _let_5 Xx0)) (not (@ _let_5 Xx1)) (not (@ _let_5 Xx2)) (not (@ _let_4 Xx0)) (not (@ _let_4 Xx1)) (not (@ _let_4 Xx2)) (not (@ _let_4 Xx3)) (not (@ _let_3 Xx0)) (not (@ _let_3 Xx1)) (not (@ _let_3 Xx2)) (not (@ _let_3 Xx3)) (not (@ _let_3 Xx4)) (not (@ _let_2 Xx0)) (not (@ _let_2 Xx1)) (not (@ _let_2 Xx2)) (not (@ _let_2 Xx3)) (not (@ _let_2 Xx4)) (not (@ _let_2 Xx5)) (not (@ _let_1 Xx0)) (not (@ _let_1 Xx1)) (not (@ _let_1 Xx2)) (not (@ _let_1 Xx3)) (not (@ _let_1 Xx4)) (not (@ _let_1 Xx5)) (not (@ _let_1 Xx6)))))))))))))))
% 30.61/30.89 (set-info :filename cvc5---1.0.5_21124)
% 30.61/30.89 (check-sat-assuming ( true ))
% 30.61/30.89 ------- get file name : TPTP file name is GRA040^2
% 30.61/30.89 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_21124.smt2...
% 30.61/30.89 --- Run --ho-elim --full-saturate-quant at 10...
% 30.61/30.89 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 30.61/30.89 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 30.61/30.89 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 30.61/30.89 % SZS status CounterSatisfiable for GRA040^2
% 30.61/30.90 % cvc5---1.0.5 exiting
% 30.61/30.90 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------